Direct or cascade product of pushdown automata
نویسندگان
چکیده
منابع مشابه
Pushdown Automata
Families of Languages AFL thm if F is closed under substitution with λ-free regular sets, morphism, union with regular sets [easy for cfg] & intersection with regular sets, then F is closed under inverse morphism Figure 26: closure properties of CF II 12 intersection with regular languages a;A/α a a;A/α λ;A/α λ;A/α { } } { ⇒ ⇒ { anbn | n ≥ 1 }∗ ∩ { w ∈ {a, b}∗ |#ax even } r1 p1 q1 r0 p0 q0 r p ...
متن کاملTeams of Pushdown Automata
We introduce team pushdown automata (PDAs) as a theoretical framework capable of modelling various communication and cooperation strategies in complex, distributed systems. Team PDAs are obtained by augmenting distributed PDAs with the notion of team cooperation or, alternatively, by augmenting team automata with pushdown memory. In a team PDA, several PDAs work as a team on the input word plac...
متن کاملSynchronization of Pushdown Automata
We introduce the synchronization of a pushdown automaton by a sequential transducer associating an integer to each input word. The visibly pushdown automata are the automata synchronized by an one state transducer whose output labels are −1, 0, 1. For each transducer, we can decide whether a pushdown automaton is synchronized. The pushdown automata synchronized by a given transducer accept lang...
متن کاملOn the Existence of Universal Finite or Pushdown Automata
It is well known that there exist universal Turing machines (UTM). Such a UTM simulates any special Turing machine (TM) M in a certain way. There are several ways of simulation. One is that a UTM U simulating a TM M with input w halts if and only if M halts on input w. Another possibility is that any computation step of M is simulated by U using some number of steps which are be restricted by s...
متن کاملReducing Deep Pushdown Automata
This contribution presents reducing variant of the deep pushdown automata. Deep pushdown automata is a new generalization of the classical pushdown automata. Basic idea of the modification consists of allowing these automata to access more deeper parts of pushdown and reducing strings to non-input symbols in the pushdown. It works similarly to bottom-up analysis simulation of context-free gramm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1977
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(77)80016-0